منابع مشابه
A Cubic Analogue of the Jacobsthal Identity
It is well known that if p is a prime such that p ≡ 1 (mod 4), then p can be expressed as a sum of two squares. Several proofs of this fact are known and one of them, due to E. Jacobsthal, involves the identity p = x2 + y2, with x and y expressed explicitly in terms of sums involving the Legendre symbol. These sums are now known as the Jacobsthal sums. In this short note, we prove that if p ≡ 1...
متن کاملNew families of Jacobsthal and Jacobsthal-Lucas numbers
In this paper we present new families of sequences that generalize the Jacobsthal and the Jacobsthal-Lucas numbers and establish some identities. We also give a generating function for a particular case of the sequences presented. Introduction Several sequences of positive integers were and still are object of study for many researchers. Examples of these sequences are the well known Fibonacci ...
متن کاملA New Generalization of Jacobsthal Numbers (bi-periodic Jacobsthal Sequences)
The bi-periodic Fibonacci sequence also known as the generalized Fibonacci sequence was fırst introduced into literature in 2009 by Edson and Yayenie [9] after which the bi-periodic Lucas sequence was defined in a similar fashion in 2004 by Bilgici [5]. In this study, we introduce a new generalization of the Jacobsthal numbers which we shall call bi-periodic Jacobsthal sequences similar to the ...
متن کاملOn Jacobsthal Binary Sequences
S. Magliveras and W. Wei∗, Florida Atlantic University Let Σ = {0, 1} be the binary alphabet, and A = {0, 01, 11} the set of three strings 0, 01, 11 over Σ. Let A∗ denote the Kleene closure of A, and Z the set of positive integers. A sequence in A∗ is called a Jacobsthal binary sequence. The number of Jacobsthal binary sequences of length n ∈ Z is the n Jacobsthal number. Let k ∈ Z, 1 ≤ k ≤ n. ...
متن کاملComputation of Jacobsthal ’ S Function
Let j(n) denote the smallest positive integer m such that every sequence of m consecutive integers contains an integer prime to n. Let Pn be the product of the first n primes and define h(n) = j(Pn). Presently, h(n) is only known for n ≤ 24. In this paper, we describe an algorithm that enabled the calculation of h(n) for n < 50. 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum Mathematicum
سال: 2012
ISSN: 0933-7741,1435-5337
DOI: 10.1515/form.2011.102